|
In coding theory, the Gilbert–Varshamov bound (due to Edgar Gilbert〔.〕 and independently Rom Varshamov〔.〕) is a limit on the parameters of a (not necessarily linear) code. It is occasionally known as the Gilbert–Shannon–Varshamov bound (or the GSV bound), but the name "Gilbert–Varshamov bound" is by far the most popular. Varshamov proved this bound by using the probabilistic method for linear code. For more about that proof, see: GV-linear-code. ==Statement of the bound== Let : denote the maximum possible size of a ''q''-ary code with length ''n'' and minimum Hamming weight ''d'' (a ''q''-ary code is a code over the field of ''q'' elements). Then: : 抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Gilbert–Varshamov bound」の詳細全文を読む スポンサード リンク
|